Musical equational programs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inductive Synthesis of Equational Programs

An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the given domain rules. To synthesize such programs, induction is necessary. We propose heuristics for generalizing from a sequence of deductive consequences. These are combined with rewrite-based methods of inductive proof...

متن کامل

Call Unfolding Strategies for Equational Logic Programs

For a programming system based on term rewrite rules such as equational logic programming, a serious eeciency problem of the generated code is the creation of terms that only serve to drive further pattern matching. In this paper, we deene a terminating call unfolding strategy based on ne-grain partial evaluation that removes much of this unnecessary term allocation for programs in intermediate...

متن کامل

Equational Abstractions for Model Checking Erlang Programs

This paper provides a contribution to the formal verification of programs written in the concurrent functional programming language Erlang, which is designed for telecommunication applications. It presents a formal description of this language in Rewriting Logic, a unified semantic framework for concurrency which is semantically founded on conditional term rewriting modulo equational theories. ...

متن کامل

Compositional Analysis for Equational Horn Programs

We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational semantics based on (basic) narrowing coincide. We define an abstract narrower mimicking this semantics, and show how it can be used as a basis for efficient ANDcompositional program analysis. As an application of our framework, we ...

متن کامل

Proving operational termination of membership equational programs

Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for advanced features such as evaluation strategies, rewriting modulo, use of extra variables in conditions, partiality, and expressive type systems (possibly including polymorphism and higher-order). However, many of those features...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGPLAN Notices

سال: 1996

ISSN: 0362-1340,1558-1160

DOI: 10.1145/240964.240977